Online promise problems with online width metrics
نویسندگان
چکیده
منابع مشابه
Online promise problems with online width metrics
In this article we introduce a new program that applies ideas from parameterized complexity, and topological graph theory, to online problems. We focus on parameterized promise problems, where we are promised that the problem input obeys certain properties, or is presented in a certain fashion. We present some algorithmic ramifications of such problems in the online setting. We explore the effe...
متن کاملPotential and promise of online volunteering
The Internet is often perceived as yet another technological innovation that causes a further widening of the gap between rich and poor. However, one of the most interesting phenomena to come out of the Internet revolution is its utilization as a channel for social development. Volunteers working in task forces who were recruited through the net, work to improve the lives of many millions of pe...
متن کاملElements affect online repurchase intentions of Malaysia’s online shoppers
Today, the internet is the significant tool of online shopping in all around the world. Online transaction systems make shopper possible to make payment for services or products utilizing the internet. The current paper purpose is to focus on the elements that can affect online repurchase intentions. In the current paper we utilized survey questionnaire to gather 102 in Malaysia from those that...
متن کاملOnline Resource Allocation Problems∗
In this paper, we consider an online resource allocation problem, where buyers with limited budgets are interested in purchasing items that consume a limited amount of resources. In general, there is no nontrivial performance guarantee for the worst cases. However, after imposing two reasonable restrictions, we can propose two online algorithms, a greedy algorithm and a primal dual algorithm, w...
متن کاملOnline vehicle routing problems
The Traveling Salesman Problem (TSP) is maybe the archetypical problem in combinatorial optimization. This problem and its generalizations, vehicle routing problems, have been studied for more than thirty years; two entire monographs are devoted to the subject [34, 26]. Since the TSP is NP-hard, polynomial-time approximation algorithms are usually studied. However, usually the approaches to the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2007
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2006.08.002